Solving tensor complementarity problems with $ Z $-tensors via a weighted fixed point method

نویسندگان

چکیده

In this paper, we focus on solving the tensor complementarity problems with $ Z $-tensors. To end, a weighted fixed point method is proposed for such problems. Then, it showed that iterative sequence generated by algorithm monotonically decreasing help of Moreover, limit solution corresponding problem. Finally numerical experiments show effectiveness and testify theoretical conclusions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An iterative fixed-point method for solving large complementarity problems in multibody systems

Aiming at a fast and robust simulation of large multibody systems with contacts and friction, this work presents a novel solution method which can solve large complementarity problems by means of a fixed-point iteration. When thousands of unilateral constraints are added to the system, our method performs like a Banach contractive mapping, providing a fast monotonic approximation to the exact L...

متن کامل

Tensor Complementarity Problem and Semi-positive Tensors

In this paper, we prove that a real tensor is strictly semi-positive if and only if the corresponding tensor complementarity problem has a unique solution for any nonnegative vector and a real tensor is semi-positive if and only if the corresponding tensor complementarity problem has a unique solution for any positive vector. It is showed that a real symmetric tensor is a (strictly) semi-positi...

متن کامل

A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems

In this paper we establish the existence of a discrete zero point of a function from the n-dimensional integer lattice Z to the n-dimensional Euclidean space IR under very general conditions with respect to the behaviour of the function. The proof is constructive and uses a combinatorial argument based on a simplicial algorithm with vector labeling and lexicographic linear programming pivot ste...

متن کامل

Sufficient weighted complementarity problems

This paper presents some fundamental results about sufficient linear weighted complementarity problems. Such a problem depends on a nonnegative weight vector. If the weight vector is zero, the problem reduces to a sufficient linear complementarity problem that has been extensively studied. The introduction of the more general notion of a weighted complementarity problem (wCP) was motivated the ...

متن کامل

A Regularization Newton Method for Solving Nonlinear Complementarity Problems

In this paper we construct a regularization Newton method for solving the nonlinear complementarity problem (NCP(F)) and analyze its convergence properties under the assumption that F is a P0-function. We prove that every accumulation point of the sequence of iterates is a solution of NCP(F) and that the sequence of iterates is bounded if the solution set of NCP(F) is nonempty and bounded. More...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Industrial and Management Optimization

سال: 2023

ISSN: ['1547-5816', '1553-166X']

DOI: https://doi.org/10.3934/jimo.2022093